On the Two-Level Uncapacitated Facility Location Problem
نویسندگان
چکیده
منابع مشابه
On the Two-Level Uncapacitated Facility Location Problem
We study the two-level uncapacitated facility location (TUFL) problem. Given two types of facilities, which we call y-facilities and z-facilities, the problem is to decide which facilities of both types to open, and to which pair of yand z-facilities each client should be assigned, in order to satisfy the demand at maximum profit. We first present two multi-commodity How formulations of TUFL an...
متن کاملUncapacitated Metric Facility Location Problem (umfl)
• Let L be a set of locations. • Let F ⊂ L be a set of potential facility locations. • Let C ⊂ L be a set of clients (cities). • Let c : L × L → R ∀i, j ∈ L be a distance function. Alternatively think of the function as describing the cost of assigning city j to facility i. • Let f : F → R ∀i ∈ F be a cost function describing the cost of opening a facility at i. • Let φ : C → F ∀j ∈ C be an ass...
متن کاملComparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints
We consider the two-level uncapacitated facility location problem with single assignment constraints (TUFLP-S), an extension of the uncapacitated facility location problem. We present six mixed-integer programming models for the TUFLP-S based on reformulation techniques and on the relaxation of the integrality of some of the variables associated with location decisions. We compare the models by...
متن کاملSolving the uncapacitated facility location problem with semi-Lagrangian relaxation∗
The Semi-Lagrangian Relaxation (SLR) method has been introduced in [BTV06] to solve the p-median problem. In this paper we apply the method to the Uncapacitated Facility Location (UFL) problem. We perform computational experiments on two main collections of UFL problems with unknown optimal values. On one collection, we manage to solve to optimality 16 out of the 18 instances. On the second col...
متن کاملLagrangean Relaxation with Clusters for the Uncapacitated Facility Location Problem
A good strategy for the solution of a large-scale problem is its division into small ones. In this context, this work explores the lagrangean relaxation with clusters (LagClus) that can be applied to combinatorial problems modeled by conflict graphs. By partitioning and removing the edges that connect the clusters of vertices, the conflict graph is divided in subgraphs with the same characteris...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 1996
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.8.3.289